9 found
Order:
  1.  18
    Heuristic search in restricted memory.P. P. Chakrabarti, S. Ghose, A. Acharya & S. C. de Sarkar - 1989 - Artificial Intelligence 41 (2):197-221.
  2.  9
    Admissibility of AO∗ when heuristics overestimate.P. P. Chakrabarti, S. Ghose & S. C. DeSarkar - 1987 - Artificial Intelligence 34 (1):97-113.
  3.  9
    Reducing reexpansions in iterative-deepening search by controlling cutoff bounds.U. K. Sarkar, P. P. Chakrabarti, S. Ghose & S. C. De Sarkar - 1991 - Artificial Intelligence 50 (2):207-221.
  4.  4
    Agent searching in a tree and the optimality of iterative deepening.Pallab Dasgupta, P. P. Chakrabarti & S. C. DeSarkar - 1994 - Artificial Intelligence 71 (1):195-208.
  5.  9
    Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search.P. P. Chakrabarti - 1994 - Artificial Intelligence 65 (2):329-345.
  6.  9
    Heuristic search through islands.P. P. Chakrabarti, S. Ghose & S. C. DeSarkar - 1986 - Artificial Intelligence 29 (3):339-347.
  7.  9
    Searching game trees under a partial order.Pallab Dasgupta, P. P. Chakrabarti & S. C. DeSarkar - 1996 - Artificial Intelligence 82 (1-2):237-257.
  8.  7
    A correction to “Agent searching in a tree and the optimality of iterative deepening”.Pallab Dasgupta, P. P. Chakrabarti & S. C. DeSarkar - 1995 - Artificial Intelligence 77 (1):173-176.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  9
    Min-max Computation Tree Logic.Pallab Dasgupta, P. P. Chakrabarti, Jatindra Kumar Deka & Sriram Sankaranarayanan - 2001 - Artificial Intelligence 127 (1):137-162.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark